\begin{itemize}
 \item Let \(G\) be a maximal planar graph; we wish to show that every drawing
   of \(G\) has only triangular faces (counting the ``unbounded'' face also as
   a triangle).

   Recall Euler's formula for planar graphs, \(V+E-F=2\).

\end{itemize}
----|----|----|----|----|----|----|----|----|----|----|----|----|----|----|----|----|----|
   5   10   15   20   25   30   35   40   45   50   55   60   65   70   75   80   85   90